UJ: Type Soundness for Universe Types
نویسندگان
چکیده
Universe types characterise aliasing in object oriented programming languages andare used to reason modularly about programs. In this report we formalise prior work byMüller and Poetzsch-Heffter, who designed the Universe Type System for a core subsetof Java. We present our work in two steps. We first give a Topological Universe TypeSystem and show subject reduction to a small-step dynamic semantics for our language.Motivated by concerns of Modular verification, we then give an Encapsulation UniverseType System (based on the owner-as-modifier principle), prove subject reduction withrespect to the former small-step semantics, and show how the type system can be usedfor modular verification.
منابع مشابه
Universe Types for Topology and Encapsulation
The Universe Type System is an ownership type system for object-oriented programming languages that hierarchically structures the object store; it is used to reason modularly about programs. We formalise Universe Types for a core subset of Java in two steps: We first define a Topological Type System that structures the object store hierarchically into an ownership tree, and demonstrate soundnes...
متن کاملA Modular Type-Checking Algorithm for Type Theory with Singleton Types and Proof Irrelevance
We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluation algorithm. We prove completeness and soundness of the algorithm; and get as a corollary the injectivity of type constructors. Then we give the definition of a correct and complete type-checking algorithm for terms ...
متن کاملNormalization by Evaluation for Martin-Löf Type Theory with One Universe
We present an algorithm for computing normal terms and types in Martin-Löf type theory with one universe and eta-conversion. We prove that two terms or types are equal in the theory iff the normal forms are identical (as de Bruijn terms). It thus follows that our algorithm can be used for deciding equality in Martin-Löf type theory. The algorithm uses the technique of normalization by evaluatio...
متن کاملOn Behavioural Interpretation of Types in Name Passing Calculi (extended Abstract)
We introduce a theory of behavioural types as a semantic foundation of typed-calculi. In this theory, a type is a set of behaviours, represented by early name passing synchronisation trees, which conform to a certain behavioural constraint. Operations on typed processes are derived from typed variants of well-known process-theoretic operations for mobile processes, and each model of typed-calcu...
متن کاملMixin modules, modules and extended value binding in a call-by-value setting
ion. Indeed, an expression supposed to be of an abstract type t evaluates to a value of its implementation type, say int for example. The equational theory of types does not contain the equality t = int , and therefore reduction does not preserve types does not hold. For DS , soundness is proved in a non-standard way. First, a new type system is defined, as the initial one, but without type abs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006